A Remark on Negation in Dependence Logic
نویسندگان
چکیده
We show that for any pair φ and ψ of contradictory formulas of dependence logic there is a formula θ of the same logic such that φ ≡ θ and ψ ≡ ¬θ. This generalizes a result of J. Burgess [2].
منابع مشابه
Complexity Results for Modal Dependence Logic
Modal dependence logic was introduced recently by Väänänen. It enhances the basic modal language by an operator =(). For propositional variables p1, . . . , pn, =(p1, . . . , pn−1, pn) intuitively states that the value of pn is determined by those of p1, . . . , pn−1. Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence logic is complete for nondeterministi...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملConstructive Negation and Constraints
Inclusion of negation into logic programs is considered traditionally to be painful as the incorporation of full logic negation tends to super-exponential time complexity of the prover. Therefore the alternative approaches to negation in logic programs are studied and among them, the procedural negation as failure sounds to be the most successful and the most widely used. However, Constraint Lo...
متن کاملDescription Logic and Order-sorted Logic
I have been studying the following work on description logic, which is closely related to my main work on extensions of order-sorted logic and logic programming [4, 3, 2]. Title: Negation in Description Logics: Contraries, Contradictories and Subcontraries (under submission) Abstract: We propose an alternative description logic ALC∼ with classical negation and strong negation. In particular, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 52 شماره
صفحات -
تاریخ انتشار 2011